Repair of Voids in Multi-Labeled Triangular Mesh

In this paper, we propose a novel mesh repairing method for voids from several meshes to ensure desired topological correctness. The input our is closed and manifold without labels. basic idea of the search repair based on multi-labeled data structure graph theory. We judgment rules between void specified model priorities. It consists three steps: (a) converting into mesh; (b) searching quasi-voids using breadth-first algorithm determining true via voids; (c) by modifying can accurately only few invalid triangular facets are removed. general, with one hundred thousand in approximately second very modest hardware. Moreover, it be easily extended process large-scale polygon models millions polygons. experimental results sets show reliability performance mesh.